Dependency Parsing Based on Dynamic Local Optimization
نویسندگان
چکیده
This paper presents a deterministic parsing algorithm for projective dependency grammar. In a bottom-up way the algorithm finds the local optimum dynamically. A constraint procedure is made to use more structure information. The algorithm parses sentences in linear time and labeling is integrated with the parsing. This parser achieves 63.29% labeled attachment score on the average in CoNLLX Shared Task.
منابع مشابه
An improved joint model: POS tagging and dependency parsing
Dependency parsing is a way of syntactic parsing and a natural language that automatically analyzes the dependency structure of sentences, and the input for each sentence creates a dependency graph. Part-Of-Speech (POS) tagging is a prerequisite for dependency parsing. Generally, dependency parsers do the POS tagging task along with dependency parsing in a pipeline mode. Unfortunately, in pipel...
متن کاملBranch and Bound Algorithm for Dependency Parsing with Non-local Features
Graph based dependency parsing is inefficient when handling non-local features due to high computational complexity of inference. In this paper, we proposed an exact and efficient decoding algorithm based on the Branch and Bound (B&B) framework where nonlocal features are bounded by a linear combination of local features. Dynamic programming is used to search the upper bound. Experiments are co...
متن کاملA Tabular Method of Finding the Optimal Word String together with its Dependency Structure
This paper describes a tabular method of nding the word string, together with its dependency structure, that has the maximum preference score in a given series of word sets. The technique, which originated in the problem of constraining the process of Japanese speech recognition by linguistic knowledge, is potentially applicable to parsing and disambiguation of various natural languages. The pr...
متن کاملRecent Advances in Dependency Parsing
Data-driven (statistical) approaches have been playing an increasingly prominent role in parsing since the 1990s. In recent years, there has been a growing interest in dependency-based as opposed to constituency-based approaches to syntactic parsing, with application to a wide range of research areas and different languages. Graph-based and transition-based methods are the two dominant data-dri...
متن کاملStochastic Dependency Parsing Based on A* Admissible Search
Dependency parsing has gained attention in natural language understanding because the representation of dependency tree is simple, compact and direct such that robust partial understanding and task portability can be achieved more easily. However, many dependency parsers make hard decisions with local information while selecting among the next parse states. As a consequence, though the obtained...
متن کامل